Novel Forms of Nearest Neighbor Queries in Spatio-Temporal Applications
نویسندگان
چکیده
Several types of nearest neighbor (NN) search have been proposed and studied in the context of spatial databases. The most common type is the point NN query, which retrieves the nearest neighbors of an input point. Such a query, however, is usually meaningless in highly dynamic environments where the query point or the database objects move/change over time. In this paper we study alternative forms of nearest neighbor queries suitable for spatio-temporal applications. In particular, we first describe time-parameterized queries, where in addition to the current nearest neighbors of a query point, the result contains the expected validity period of the result (given the query and object movement), as well as the change that will occur at the end of the validity period. Then, we discuss continuous NN search where the goal is to retrieve all nearest neighbors of a query trajectory, together with the validity interval of each nearest neighbor. Νέες Μορφές Ερωτήσεων Πλησιέστερου Γείτονα σε Χωρο-χρονικές
منابع مشابه
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatio-temporal pattern as a sequence of distinct spatial predicates where the predicate temporal ordering (exact or relative) matters. STP queries can use various types of spatial predicates (range search, nearest neighbor, etc.) where each such predicate is associated (1) ...
متن کاملReverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories
Reverse nearest neighbor (RNN) queries in spatial and spatio-temporal databases have received significant attention in the database research community over the last decade. A reverse nearest neighbor (RNN) query finds the objects having a given query object as its nearest neighbor. RNN queries find applications in data mining, marketing analysis, and decision making. Most previous research on R...
متن کاملValidity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds
The results of traditional spatial queries (i.e., range search, nearest neighbor, etc.) are usually meaningless in spatio-temporal applications, because they will be invalidated by the movements of query and/or data objects. In practice, a query result R should be accompanied with validity information specifying (i) the (future) time T that R will expire, and (ii) the change C of R at time T (s...
متن کاملNearest Neighbor Queries in a Mobile Environment
Nearest neighbor queries have received much interest in re cent years due to their increased importance in advanced database ap plications However past work has addressed such queries in a static setting In this paper we consider instead a dynamic setting where data objects move continuously Such a mobile spatiotemporal environment is motivated by real life applications in tra c management inte...
متن کاملClosest pair queries in spatio-temporal databases
In recent years, spatio-temporal databases have been studied intensively. This paper proposes how to process k closest pair queries in spatio-temporal databases for the first time. A spatio-temporal k closest pair query continuously searches the k closest pairs between a set of spatial objects and a set of moving objects for a specified time interval of the query. To maintain the order of the k...
متن کامل